6.842 Randomness and Computation
نویسنده
چکیده
Today we will discuss two more applications of the low degree algorithm. First we will look at constant depth circuits. We will cite a theorem regarding the Fourier concentration of functions computable by constant depth circuits and we will use this theorem as well as the low degree algorithm to show how we can learn constant depth circuits. Second we will begin to develop the theory need to learn functions of halfspaces. To do this we will explore the notion of noise sensitivity which will ultimately allow us to bound the Fourier concentration of these types of functions and learn them through the low degree algorithm.
منابع مشابه
Some Bridging Results and Challenges in Classical, Quantum and Computational Randomness
1. Why were you initially drawn to the study of computation and randomness? 2 1.1. Physical randomness (classical) 2 1.2. Physical randomness (quantum) 2 1.3. Algorithmic randomness 3 1.4. Computer science randomness 3 1.5. Biology 4 2. What have we learned? 4 2.1. Physical randomness (classical) 5 2.2. Physical randomness (quantum) 5 2.3. Algorithmic randomness 5 2.4. Randomness in computer sc...
متن کاملRandomness: Four Questions and Some Challenges
1. Why were you initially drawn to the study of computation and randomness? 2 1.1. Physical randomness (classical) 2 1.2. Physical randomness (quantum) 2 1.3. Algorithmic randomness 3 1.4. Computer science randomness 3 1.5. Biology 4 2. What have we learned? 4 2.1. Physical randomness (classical) 5 2.2. Physical randomness (quantum) 5 2.3. Algorithmic randomness 5 2.4. Randomness in computer sc...
متن کاملSource Coding and Simulation
Man has grappled with the meaning and utility of randomnessfor millennia. Randomness is paramount to many fields of sci-ence, and in particular plays a key role in information theory andcoding theory. Here we explore some key aspects of the meaningand utility of randomness in computation.
متن کاملRandomness and Computation
The interplay of randomness and computation is at the heart of modern Cryptography and plays a fundamental role in the design of algorithms and in the study of computation at large. Specifically, this interplay is pivotal to several intriguing notions of probabilistic proof systems (e.g., interactive proofs, zero-knowledge proofs, and probabilistically checkable proofs), is the focal of the com...
متن کاملThe Mathematical Foundations of Randomness
Wegive anontechnical account of themathematical theoryof randomness. The theory of randomness is founded on computability theory, and it is nowadays often referred to as algorithmic randomness. It comes in two varieties: A theory of finite objects, that emerged in the 1960s through the work of Solomonoff, Kolmogorov, Chaitin and others, and a theory of infinite objects (starting with von Mises ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012